Vector Orthogonal Polynomials and Least Squares Approximation
نویسندگان
چکیده
منابع مشابه
Vector Orthogonal Polynomials and Least Squares Approximation
We describe an algorithm for complex discrete least squares approximation, which turns out to be very efficient when function values are prescribed in points on the real axis or on the unit circle. In the case of polynomial approximation, this reduces to algorithms proposed by Rutishauser, Gragg, Harrod, Reichel, Ammar and others. The underlying reason for efficiency is the existence of a recur...
متن کاملMoving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the moving least squares method caused by particular configurations of nodes in the system. The method is tested by applying it to the estimation of first and seco...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملLeast-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials
where x(t) ∈ D ⊂ Rp and f (x) ∈ R is an unknown function but assumed to be bounded function in x. When the structure of the uncertainty is unknown, function approximation is usually employed to estimate the unknown function. In recent years, neural networks have gained a lot of attention in function approximation theory in connection with adaptive control. Multi-layer neural networks have the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1995
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479893244572